Hamiltonian powers in threshold and arborescent comparability graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give efficient algorithms as well as sufficient and minimax toughness like conditions. For arborescent comparability graphs we have similar results but also show that for one type of completion problem an ‘obvious’ minimax condi...
متن کاملPowers of Hamiltonian paths in interval graphs
We give a simple proof that the obvious necessary conditions for a graph to contain the kth power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We will also discuss covers by powers of paths and analogues of the Hamiltonian completion number. c © ...
متن کاملPartitioning powers of traceable or hamiltonian graphs
A graph G = (V,E) is arbitrarily partitionable (AP) if for any sequence τ = (n1, . . . , np) of positive integers adding up to the order of G, there is a sequence of mutually disjoints subsets of V whose sizes are given by τ and which induce connected graphs. If, additionally, for given k, it is possible to prescribe l = min{k, p} vertices belonging to the first l subsets of τ , G is said to be...
متن کاملSome Hamiltonian Results in Powers of Graphs * Arthur
In this paper we show that the connectivity of the kth power of a graph of connectivity m is at least km if the kth power of the graph is not a complete graph. Also, we. prove th at removing as many as k 2 vertices from the kth power of a graph (k ;;. 3) leaves a Hamiltonian graph, and that removing as many as k 3 vertices from the kth power of a graph (k;;' 3) leaves a Hamiltonian con nected g...
متن کاملComparability graphs and intersection graphs
A function diagram (f-diagram) D consists of the family of curves {i, . . . , ii} obtained from n continuous functions fi : [O, 1] -B R (1 G i d n). We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement 0 is a comparability graph. An f-diagram generalizes the notion cf a permutation diagram where the fi are linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00346-x